Linear-time connected-component labeling based on sequential local operations
نویسندگان
چکیده
This paper presents a fast algorithm for labeling connected components in binary images based on sequential local operations. A one-dimensional table, which memorizes label equivalences, is used for uniting equivalent labels successively during the operations in forward and backward raster directions. The proposed algorithm has a desirable characteristic: the execution time is directly proportional to the number of pixels in connected components in an image. By comparative evaluations, it has been shown that the efficiency of the proposed algorithm is superior to those of the conventional algorithms. 2003 Elsevier Science (USA). All rights reserved.
منابع مشابه
Fast Connected-Component Labeling Based on Sequential Local Operations in the Course of Forward Raster Scan Followed by Backward Raster Scan
This paper presents a fast algorithm for labeling connected components in binary images based on sequential local operations. A one-dimensional table, which memorizes label equivalences, is used for uniting equivalent labels successively during the operations in forward and backward raster directions. The proposed algorithm has a desirable characteristic: the execution time is directly proporti...
متن کاملA Fast Algorithm for Image Component Labeling with Local Operators on Mesh Connected Computers
A new parallel algorithm for image component labeling with local operators on SIMD mesh connected computers is presented. This algorithm provides a positive answer to the open question whether there exists an O(n)–time and O(log n)–space local labeling algorithm on SIMD mesh connected computers. The algorithm uses a pipeline mechanism with stack–like data structures to achieve the lower bound o...
متن کاملBlock-Based Connected-Component Labeling Algorithm Using Binary Decision Trees
In this paper, we propose a fast labeling algorithm based on block-based concepts. Because the number of memory access points directly affects the time consumption of the labeling algorithms, the aim of the proposed algorithm is to minimize neighborhood operations. Our algorithm utilizes a block-based view and correlates a raster scan to select the necessary pixels generated by a block-based sc...
متن کاملFast Parallel Connected Component Labeling Algorithms Using Cuda Based on 8-directional Label Selection
Connected component labeling (CCL) is a key step in image segmentation where foreground pixels are extracted and labeled. Sequential CCL is a computationally expensive operation and thus is often done within parallel processing framework to reduce execution time. Various parallel CCL methods have been proposed in the literature. Among them NSZ label equivalence (NSZ-LE) method seemed to perform...
متن کاملThe Detection Of Local Abnormalities In Random Macro Textures
Various techniques have been suggested for the detection of abnormalities in regularly textured patterns. These consist of searching for strong variations in a scene of replicated texture primi-tives. However, higlighting irregularities in randomly structured textures such as ceramic, granite or marble, is more challenging. We present a group of techniques which are based in both the spatial an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Computer Vision and Image Understanding
دوره 89 شماره
صفحات -
تاریخ انتشار 2003